Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska's Theorem Revisited
نویسندگان
چکیده
We provide a new proof of the following Pa lasińska’s theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are Q-relation formulas, for a protoalgebraic equality free quasivariety Q, which are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool at hand, we prove a finite axiomatization theorem for Q when it has definable principal Q-subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which is enjoyed by finitely generated protoalgebraic relation distributive equality free quasivarieties.
منابع مشابه
On Reduced Semantics for Fuzzy Predicate Logics
Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative relation. On the one hand, the Leibniz congruence of a model identifies the elements that are indistinguishable...
متن کاملInconsistency lemmas in algebraic logic
In this paper, the inconsistency lemmas of intuitionistic and classical propositional logic are formulated abstractly. We prove that, when a (finitary) deductive system ` is algebraized by a variety K, then ` has an inconsistency lemma—in the abstract sense—iff every algebra in K has a dually pseudo-complemented join semilattice of compact congruences. In this case, the following are shown to b...
متن کاملFully Adequate Gentzen Systems and the Deduction Theorem
An infinite sequence ∆ = 〈∆n(x0, . . . , xn−1, y, ū) : n < ω〉 of possibly infinite sets of formulas in n + 1 variables x0, . . . , xn−1, y and a possibly infinite system of parameters ū is a parameterized graded deduction-detachment (PGDD) system for a deductive system S over a S-theory T if, for every n < ω and for all φ0, . . . , φn−1, ψ ∈ FmΛ, T, φ0, . . . , φn−1 `S ψ iff T `S ∆n(φ0, . . . ,...
متن کاملCategorical Abstract Algebraic Logic: Equivalential
The theory of equivalential deductive systems, as introduced by Prucnal and Wroński and further developed by Czelakowski, is abstracted to cover the case of logical systems formalized as π-institutions. More precisely, the notion of an N-equivalence system for a given π-institution is introduced. A characterization theorem for N-equivalence systems, previously proven for N-parameterized equival...
متن کاملPreserving mappings in fuzzy predicate logics
In this paper we develop the method of diagrams for fuzzy predicate logics and give a characterization of different kinds of preserving mappings in terms of diagrams. Our work is a contribution to the modeltheoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts bei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 101 شماره
صفحات -
تاریخ انتشار 2013